Active Idleness Scheduler with Simulated Annealing ?

نویسنده

  • Carlos F. Bispo
چکیده

In this paper we address the problem of optimizing the Time Window Controller (TW-Controller). This controller was first introduced in 2001 as a supervising mechanism for distributed scheduling of multiclass queuing networks with the objective of stabilizing those networks. It was then also shown that the TW-Controller possesses the ability to improve performance of stable networks. We revise the controller and present a series of formal results concerning its main properties and features. Then, we propose to use Simulated Annealing on a simulation-based optimization approach and present numerical results that demonstrate the controller’s ability to improve performance over any given scheduling policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulated Annealing Approach to Cost-based Multi- Quality of Service Job Scheduling in Cloud Computing Enviroment

Cloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the fundamental issues in this environment is relate...

متن کامل

Instruction Scheduling Using Simulated Annealing

Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...

متن کامل

Job - Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search

The Job-Shop Scheduling Problem (JSSP) is one of the most difficult NP-hard combinatorial optimization problems. This paper proposes a new method for solving JSSPs based on simulated annealing (SA), a stochastic local search, enhanced by shifting bottleneck (SB), a problem specific deterministic local search. In our method new schedules are generated by a variant of Giffler and Thompson’s activ...

متن کامل

Integrating intelligent job-scheduling into a real-world production-scheduling system

The paper addresses the problem of scheduling production orders (jobs). First an approach based on simulated annealing and Hopfield nets is described. Since performance was unsatisfactory for real-world applications, we changed problem representation and tuned the scheduling method, dropping features of the Hopfield net and retaining simulated annealing. Both computing time and solution quality...

متن کامل

HybridSGSA: SexualGA and Simulated Annealing based Hybrid Algorithm for Grid Scheduling

Scheduling jobs on computational grids is a compute intensive problem. Existing methods are unable to perform the required breakthrough in terms of time and cost. A Grid scheduler must use the available resources efficiently, while satisfying competing and mutually conflicting goals. The grid workload may consist of multiple jobs, with varying resource requirements and quality-of-service constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012